Dominating set

Results: 145



#Item
710000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Add to Reading List

Source URL: mrfellows.net

Language: English - Date: 2009-09-08 08:50:37
72Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati

Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2005-07-06 08:19:04
73CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
74Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-05 20:16:31
75Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§

Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2009-10-29 15:21:24
76CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:18
77CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
78Welcome Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We are delighted to announce the IPEC 2010 winners of the Excellent Student Paper Awards. The meeting was expertly organized in Chennai

Welcome Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We are delighted to announce the IPEC 2010 winners of the Excellent Student Paper Awards. The meeting was expertly organized in Chennai

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 05:22:16
79A Fast Algorithm for Point Labeling Problem Sasanka Roy∗ Subhasis Bhattacharjee∗ Subhas C. Nandy

A Fast Algorithm for Point Labeling Problem Sasanka Roy∗ Subhasis Bhattacharjee∗ Subhas C. Nandy

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-08-05 21:28:00
80

PDF Document

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2013-01-31 16:33:06